Diclib.com
Словарь ChatGPT

Поиск в словаре Индивидуальные решения

Введите слово или словосочетание на любом языке 👆

Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

Что (кто) такое cache conflict - определение

COMPUTING COMPONENT THAT TRANSPARENTLY STORES DATA SO THAT FUTURE REQUESTS FOR THAT DATA CAN BE SERVED FASTER

Caching; Draft:Cache memory; Write-through; Write-thru; Write-back; No-write allocation; Cache miss; Cache conflict; Cache hit; Cache-Memory; Memory cache; Write through cache; Write back cache; Cash memory; Cache misses; Cacheable content; Cache Memory; Dirty cache; Dirty flag; SQL caching; Game Cache File; Lazy write; Dirty (computer science); Backing store; Result cache; Memory caching; Caching (computing); Write-around; Write-behind; Writeback; Cache memory; GPU cache; Cache hit ratio; Cache hit rate; Write-back cache; Hardware cache; Software caches; Remote memory; Remote cache; Stack cache; Copy back cache; Writethrough

cache conflict

<storage> A sequence of accesses to memory repeatedly overwriting the same cache entry. This can happen if two blocks of data, which are mapped to the same set of cache locations, are needed simultaneously. For example, in the case of a direct mapped cache, if arrays A, B, and C map to the same range of cache locations, thrashing will occur when the following loop is executed: for (i = 1; i < n; i++) C[i] = A[i] + B[i]; Cache conflict can also occur between a program loop and the data it is accessing. See also ping-pong. (1997-01-21)

secondary cache

DYNAMICALLY MANAGED LOCAL MEMORY THAT MIRRORS MAIN MEMORY IN A MICROPROCESSOR TO REDUCE THE COST OF ACCESS

Level 1 cache; Level 2 cache; Cache line; CPU memory cache; Trace Caches; Trace caches; Cache block; Cache-line; L2 cache; L3 cache; L1 cache; CPU caches; CPU Cache; Data cache; Internal cache; Data Cache; First-level cache; L2-Cache; L1-Cache; Second-level cache; Secondary cache; Tag RAM; Direct mapped; Cpu cache; Instruction cache; L2 Cache; Cache flush; Motherboard cache; Discrete L2 cache; Level 3 cache; VIVT; VIPT; I cache; Processor cache; Internal and external cache; Multi-ported Cache; Smart Cache; CPU cache line; Copy-back; L4 cache; Micro-operation cache; Uop cache; Last level cache; Last Level Cache; Cache eviction; Exclusive CPU cache; Inclusive CPU cache; Exclusive cache; Inclusive cache; Multi-level cache; Multilevel cache; On-chip cache; Cache lines; Shared cache; Non-blocking cache; Branch target cache; Branch target instruction cache; SmartCache; Smart cache; L1d

<memory management> (Or "second level cache", "level two cache", "L2 cache") A larger, slower cache between the primary cache and main memory. Whereas the primary cache is often on the same integrated circuit as the {central processing unit} (CPU), a secondary cache is usually external. (1997-06-25)

Web cache

MECHANISM FOR THE TEMPORARY STORAGE (CACHING) OF WEB DOCUMENTS

Web caching; HTTP cache; Browser Cache; Browser Caching; Squirrel (DHT); Squirrel dht; Web caches; Proxy cache; Browser cache; Cache server; Internet cache; Http cache; HTTP caching; Webcache; Cache-Control; Web browser cache; Bypass your cache; Webcaching; List of server-side web caching software; Forward cache; Reverse cache

A Web cache (or HTTP cache) is a system for optimizing the World Wide Web. It is implemented both client-side and server-side.

https://en.wikipedia.org/wiki/Web_cache

Википедия

Cache (computing)

In computing, a cache ( (listen) KASH) is a hardware or software component that stores data so that future requests for that data can be served faster; the data stored in a cache might be the result of an earlier computation or a copy of data stored elsewhere. A cache hit occurs when the requested data can be found in a cache, while a cache miss occurs when it cannot. Cache hits are served by reading data from the cache, which is faster than recomputing a result or reading from a slower data store; thus, the more requests that can be served from the cache, the faster the system performs.

To be cost-effective and to enable efficient use of data, caches must be relatively small. Nevertheless, caches have proven themselves in many areas of computing, because typical computer applications access data with a high degree of locality of reference. Such access patterns exhibit temporal locality, where data is requested that has been recently requested already, and spatial locality, where data is requested that is stored physically close to data that has already been requested.

https://en.wikipedia.org/wiki/Cache (computing)